Data transmission method, transmitter, and receiver

ABSTRACT

The invention relates to a data transmission method, a transmitter and a receiver in a system which utilizes the CDMA method, in which several users communicate simultaneously on the same frequency band, and in which each user has its own spreading code, and in which the information channel capacity of at least one user differs from the capacity of the other users, the receiver comprising converter means for converting a received transmission into a digital form, and a number of means for synchronizing and for calculating the characteristic required for a decision from the transmission of each received user. In order to advantageously receive transmissions with multiple data rates or capacities in a receiver according to the invention, said number of means each comprise a group of correlators which may synchronized with waveforms of different types, and the receiver comprises means for processing said characteristics calculated for different types of waveforms by eliminating the effect of their mutual correlations.

The invention relates to a data transmission method in a system which utilizes the CDMA method, in which several users communicate simultaneously on the same frequency band, and in which each user has at least one broad-band information channel, and in which the information channel capacity of at least one user differs from the capacity of the other users.

CDMA (Code Division Multiple Access) is a multiple access method, which is based on the spread spectrum technique and which has been applied recently in cellular radio systems, in addition to the prior FDMA and TDMA methods. CDMA has several advantages over the prior methods, for example spectral efficiency and the simplicity of frequency planning.

In the CDMA method, the narrow-band data signal of the user is multiplied to a relatively wide band by a spreading code having a considerably broader band than the data signal. In known test systems, bandwidths such as 1.25 MHz, 10 MHz and 25 MHz have been used. In connection with multiplying, the data signal spreads to the entire band to be used. All users transmit by using the same frequency band simultaneously. A separate spreading code is used over each connection between a base station and a mobile station, and the signals of the users can be distinguished from one another in the receivers on the basis of the spreading code of each user.

A CDMA receiver comprises means, which can be implemented for example with correlators or matched filters, for synchronization with a desired signal, which is recognized on the basis of the spreading code. In the receiver, the data signal is restored to the original band by multiplying it again by the same spreading code as during the transmitting stage. Signals multiplied by some other spreading code do not correlate in an ideal case and are not restored to the narrow band. They appear thus as noise with respect to the desired signal. The spreading codes of the system are preferably selected in such a way that they are mutually orthogonal, i.e. they do not correlate with each other.

A CDMA system according to the background art is disclosed in U.S. Pat. No. 5,166,951, which is incorporated herein by reference and which describes a high-capacity system wherein the spreading code sequences used in the information channels are mutually orthogonal.

In a typical mobile phone environment, the signals between a base station and a mobile station propagate along several paths between the transmitter and the receiver. This multipath propagation is mainly due to the reflections of the signal from the surrounding surfaces. Signals which have propagated along different paths arrive at the receiver at different times due to their different transmission delays. CDMA differs from the conventional FDMA and TDMA in that the multipath propagation can be exploited in the reception of a signal. One way of realizing a CDMA receiver is to use for example a so-called rake receiver, which consists of one or more rake branches. Each branch is an independent receiver unit, the function of which is to compose and demodulate one received signal component. Each rake branch can be caused to synchronize with a signal component which has propagated along an individual path, and in a conventional CDMA receiver the signals of the receiver branches are combined advantageously, for example coherently, whereupon a signal of good quality is obtained. The signal components received by the receiver branches may be transmitted from one base station, or in the case of macrodiversity, from several base stations.

The present cellular systems are mainly designed for the transmission of conventional speech traffic. This is also true for the latest digital systems, such as the European GSM system. There have been efforts to also enable the transmission of data services in digital systems, but so far the services and possibilities provided therein have been of inferior quality than in the fixed network.

An aim in developing cellular radio systems is to better take into account the needs of different data services. An essential factor in the transmission of services is that different services require transmission channels with considerably different capacity and quality requirements. The requirements set for both transmission rate and bit error ratio, for example, may vary depending on the type of service. For example, the transmission of video image over the radio path of the cellular system requires considerably more capacity than the transmission of speech.

An obvious manner of solving the problem of implementing connections requiring different amounts of capacity is to utilize the present speech channels flexibly so that connections requiring a high capacity are provided with several channels. In TDMA systems this often means several time slots, and in CDMA systems it means that a subscriber terminal simultaneously transmits and receives transmissions provided with several spreading codes. However, this is a very simple manner of implementing a system with multiple data rates or quality criteria, and it wastes capacity.

The purpose of the present invention is to provide a method of implementing multiple data rates or quality criteria in such a way that the quality of signals remains good and that the capacity of the system will be efficiently utilized. A further purpose of the present invention is to implement a transmitter that is capable of transmitting the signal of the user in an information channel having the desired capacity. Another purpose of the present invention is to implement a receiver that is capable of receiving signals with different types of waveforms and of eliminating the effect of interfering signals from desired transmissions.

This is achieved with the method of the type described in the preamble, characterized in that the parameters of each information channel depend on the desired capacity and transmission quality, and that each information channel is detected by taking into account the correlations between the channels.

The invention also relates to a receiver in a system which utilizes the CDMA method, in which several users communicate simultaneously on the same frequency band, and in which each user has its own spreading code, and in which the information channel capacity of at least one user differs from the capacity of the other users, the receiver comprising converter means for converting a received transmission into a digital form, and a number of means for synchronizing and for calculating the characteristic required for a decision from the transmission of each received user. The receiver according to the invention is characterized in that said number of means each comprise a group of correlators which may be synchronized with waveforms of different types, and that the receiver comprises means for processing said characteristics calculated for the different types of waveforms by eliminating the effect of their mutual correlations.

The invention also relates to a transmitter in a system which utilizes the CDMA method and in which several users communicate simultaneously on the same frequency channel, the transmitter comprising means for forming the symbols to be transmitted. The transmitter according to the invention is characterized in that the transmitter comprises means regulating the length of the symbols to be transmitted, means for converting a desired number of symbols to be transmitted into a parallel form, means for generating spreading code sequences the number of which equals the number of the symbols to be transmitted in parallel, and means for multiplying each of the symbols to be transmitted by its own sequence.

In the method according to the invention, different data transmission needs can be implemented together with a high transmission quality. Each system user may have different parameters of the transmission connection, i.e. the type of the waveform in the information channel used, according to the requirements set for the connection. In this connection, connection parameters refer to for example the chip rate or length of the spreading code and to the data symbol length.

In a preferred embodiment of the invention, different users have data symbols of different length. The data symbol lengths of different users are selected in such a way that the symbol lengths used are fractions of the length of a specific given super symbol. The spreading code sequences that modulate the data symbols of the users recur at intervals of the given super symbol. During detection the interference between the users can be decreased by taking into account the mutual correlations between the received signals. Detection can be implemented advantageously in such a way that a desired number of signals are received and correlation terms over the super symbol to be detected are calculated, and these correlation terms are utilized in the detection in such a way that the mutual interference between the signals to be transmitted with different data symbol rates can be eliminated.

In a second embodiment of the invention, which can be used as a part of the above-described embodiment, a user transmits some of his data symbols in a parallel form so that each parallel symbol is multiplied by a spreading code sequence that is formed of parts of a longer spreading code. This spreading code is used over connections requiring a lower capacity to multiply one symbol. In a third embodiment of the invention, the spreading codes by which the parallel data symbols are multiplied are substantially mutually nonorthogonal. In the receiver the signals naturally interfere with one another, but the interference can be eliminated during the detection by means of a suitable interference cancellation algorithm.

In the following, the invention will be described in greater detail with reference to the examples according to the accompanying drawings, in which

FIG. 1a illustrates the transmission with different data rates and the use of a super symbol,

FIG. 1b illustrates the power distribution between users transmitting at different data rates,

FIGS. 2a to 2 d illustrate the use according to the invention of different spreading code alternatives,

FIG. 3 is a block diagram of a possible implementation of a transmitter according to the invention,

FIGS. 4a and 4 b are more detailed block diagrams of alternative implementations of a transmitter according to the invention,

FIG. 5 is a block diagram illustrating a possible implementation of a receiver according to the invention,

FIG. 6 is a more detailed block diagram illustrating a possible implementation of a receiver according to the invention,

FIG. 7 is a block diagram illustrating a group of matched filters, and

FIG. 8 is a block diagram illustrating a possible implementation of an interference cancellation block in a receiver according to the invention.

In the following, an asynchronous CDMA system wherein the method according to the invention can be applied is first described by way of example. Correspondingly, the invention is also applicable to a synchronous system, as it is evident for a person skilled in the art.

Assume that the asynchronous CDMA system comprises K users, each of which is assigned a spreading waveform ${s_{k}(t)} = {\sum\limits_{j = 1}^{N_{k}}{s_{k}^{(j)}{\Pi_{T_{c,k}}\left( {t - {jT}_{c,k}} \right)}}}$

where the jth chip, i.e. bit, of the spreading waveform of the kth user is obtained with

S _(k) ^((j))ε{−1,1}, k=1, . . . K.

Above, T_(c,k) is the chip length of the kth user, N_(k) is the number of chips in the spreading waveform of the kth user. No restrictions are set for the spreading code of the user. The user k may have a unique chip length T_(c,k) (bandwidth), symbol length T_(b,k), and a time-varying waveform, since N_(k)T_(c,k)≧T_(b,k). The users transmit information by modulating the spreading waveforms by data symbols b_(k) ⁽¹⁾ εA, where A is the symbol alphabet. In the CDMA, all users transmit simultaneously on the same frequency. The function of the receiver is thus to demodulate the summed signal $\begin{matrix} {{{r(t)} = {{\sum\limits_{k = 1}^{K}{\sum\limits_{j = {- P}}^{P}{{h_{k}(t)}{w_{k}^{(b_{k})}\left( {t - {iT}_{b} - \tau_{k}} \right)}}}} + {n(t)}}},} & (1) \end{matrix}$

where n(t) represents white Gaussian noise with variance σ², 2P+1 denotes the length of the data packet, h_(k)(t) denotes the impulse response of the physical channel of the kth user, and $w_{k}^{(b_{i})} = {\sum\limits_{m = 0}^{M - 1}{{s_{k,m}(t)}b_{k}^{({{i \times M} + m})}{i_{\lbrack{0,{T_{b}\lbrack}}}(t)}}}$

is the modulated waveform of user k which has the symbol sequence b_(i)=(b_(k), . . . ,b_(k) ^((i×M+m))) (subscript k is omitted from the symbol b_(i), since it is implicitly expressed in the waveform w_(k)).

It is also assumed, without limiting the generality, that the multipath channel is of the form ${h_{k}(t)} = {\sum\limits_{l = 1}^{L}{{h_{k,l}(t)}{\delta \left( {t - {\tau_{k,l}(t)}} \right)}}}$

where the lth channel tap of the kth user is denoted by h_(k,l) εC. It is assumed that the delays τ_(k,l) are known or have been estimated beforehand and that they remain constant during the transmission. With these assumptions it is possible to omit the time index and to write τ_(k,l)≡τ_(k,l)(t). In the following the complex taps h_(k,l)(t) are either constant or fading as a function of time.

In the following, preferred embodiments of the method according to the invention for providing multiple data rata transmission in the CDMA system are described.

Assume first that each user k has the same chip rate of the spreading code, i.e. T_(c,1)≡T_(c,2)≡ . . . T_(c,K). According to their need for capacity, different users may be provided with different symbol rates, which are fractions of a specific super symbol length. The spreading code sequence used recurs at intervals of the super symbol. The situation is illustrated in FIG. 1a, which shows four users, k=1, . . . , 4, and in which user k=1 has the lowest symbol rate that equals the super symbol rate. For the sake of clarity, the figure also shows the length of one spreading code bit, or chip, by way of example. In reality, the chip length can be smaller than FIG. 1a shows.

The data rate of user k=1 is denoted in the example of FIG. 1a with the letter R. User k=2 has a double symbol rate, i.e. 2R. Users k=3 and k=4 have a fourfold symbol rate 4R compared with the super symbol rate. A possible power distribution between these users is shown in FIG. 1b. User k=4 utilizing the highest symbol rate also has the greatest proportion of the power. Examine in the following two possible ways of implementing multiple data rate transmission, both of these manners being applicable in the preferred embodiment of the invention.

Generally, the information channel of user k having an M-fold symbol rate compared with the basic rate can be implemented in the form of M parallel information channels. The situation is illustrated by the formula ${{w_{k}(t)} = {\sum\limits_{m = 0}^{M - 1}{s_{k,m}(t)}}},$

where each S_(k,m)(t) is time-limited to [0,T_(b,k)[. The spreading codes used in different channels can be selected for example from the hadamard code set, so that they are sufficiently orthogonal. In the method according to the invention wherein the detection of the received signal utilizes the mutual correlations of the received signals, codes that are mutually substantially nonorthogonal, i.e. that interfere with one another, can also be used in the different information channels of the same user. The interference of one user, generated on purpose, can be eliminated in the receiver by means of interference cancellation algorithms.

Secondly, user k can transmit information utilizing time-orthogonal waveforms, where

s _(k,m)(t)=s _(k,m)(t)1_(r) _(k,m) ,

where $\left\lbrack {0,{T_{k,b}\left\lbrack {= {\bigcup\limits_{m = 0}^{M - 1}T_{k,b,m}}} \right.},{{\bigcap\limits_{m = 0}^{M - 1}T_{k,b,m}} = {.}}} \right.$

The data symbols of the user are thus modulated by M time-orthogonal codes, if it is assumed that user k has an M-fold symbol rate compared with the basic rate. The aforementioned M time-orthogonal subcodes are preferably of equal length.

The use of different spreading code alternatives according to the invention is illustrated in FIGS. 2a to 2 d. Assume that there are two users k=1,2, of which user k=1 transmits at the basic rate of the system, i.e. the data symbol of the user has the same length as the super symbol. This is illustrated in FIG. 2a, which shows the data symbol b_(1,1) of user k=1, this data symbol having the length of the super symbol SS and being modulated by a spreading code of the length of the super symbol. Assume that user k=2 transmits at a data rate which is threefold compared to user k=1, i.e. in this example M is 3. This is illustrated in FIG. 2b, which shows the data symbols b_(1,2), b_(2,2) and b_(3,2) of user k=2, the symbols together having the length of the super symbol SS. FIG. 2c illustrates an example where the data symbols of user k=2 are multiplied during transmission by one spreading code SC1 having the length of the super symbol. FIG. 2d in turn illustrates an example where each of the data symbols b_(1,2), b_(2,2), and b_(3,2), of user k=2 is multiplied during transmission by its own time-orthogonal spreading code sequence SC2, SC3 and SC4, respectively.

The spreading codes used may naturally also be complex spreading codes. The I and Q branch may have different spreading codes. When different spreading codes, spreading ratios and data rates are used over different connections, the frequency band utilized by each user may vary. One user may utilize, for example, a band of 5 MHz and another user a band of 2.5 MHz, the bands being located partially superimposed in the frequency domain on the frequency range reserved for the system. The use of the spreading codes is illustrated in Boztas S., Kumar P. V.: Near Optimal 4Φ sequences for CDMA (Proc. ISIT 1991, Budapest, Hungary, p. 282, June 1991).

FIG. 3 is a general block diagram illustrating the structure of a transmitter according to the invention. The figure shows a block diagram of a subscriber terminal, but the transmitter according to the invention can naturally also be realized in a similar manner in a base station transmitter. The transmitter comprises a microphone 30, a speech coder 31, means 32 for performing channel coding, means 33 for multiplying the signal to be transmitted by a spreading code, and radio-frequency means 34 which transfer the signal to be transmitted to the frequency domain used over the radio path, and an antenna 35. The transmitter also comprises a control unit 36, which controls the operation of the parts of the transmitter. The control unit 36 is typically realized by means of a microprocessor. The transmitter to be realized may naturally also comprise other components, such as filters, A/D converters, and a user interface, such as a keyboard and a display unit, as it is clear for a person skilled in the art, but since they are not essential to the present invention they will be not shown in the figure in order to keep it simple. Further, the transmitter may comprise some other data source instead of a microphone and a speech coder.

FIG. 4a is a block diagram illustrating in greater detail the structure of a transmitter according to a preferred embodiment of the invention. In the transmitter according to the invention, the control unit 36 regulates the symbol formation in the speech coder or data source 31 and in the coding means 32 in such a way that the symbols to be transmitted in the output signal 40 of the coding means 32 are of desired length. The transmitter further comprises means 41 for converting the signal to be transmitted into a parallel form. The converter means 41 can be implemented for example with a serial-to-parallel converter. The symbols converted into a parallel form are supplied to means 42 a to 42 c wherein a required number of spreading code sequences are generated, the number of the sequences equalling the number of the symbols to be transmitted in parallel, and each of the symbols to be transmitted being multiplied in the means by a different sequence. Depending on the data rate used, the number of the parallel symbols may vary in different calls according to control from the control means 36. With reference to FIGS. 2a to 2 d and to the corresponding description, if the data rate of user k=1 equals the basic rate, only one pair of spreading coding means 42 a are used, i.e. there is no need for parallel transmission. If user k=2 transmits at a data rate that is threefold compared to the data rate of user k=1, three parallel symbols are transmitted, and they are multiplied in parallel by the spreading code sequences SC2, SC3 and SC4, respectively, according to FIG. 2d.

The spreading codes used in the means 42 a to 42 c can be formed of successive parts of a longer code having the length of for example a super symbol. The spreading codes used in the means 42 a to 42 c can also be selected in such a way that some of the codes are substantially mutually nonorthogonal. Each of the means 42 a to 42 c thus comprises, according to FIG. 4c, means 46 for generating a spreading code sequence and means 47 for multiplying the symbols 48 to be transmitted with these sequences. The means 46, 47 can be implemented utilizing known components, such as shift registers and multipliers. The generation of the spreading codes is described in greater detail in G. R. Cooper, C. D. McGillem: Modern Communications And Spread Spectrum (McGraw-Hill, Singapore, 1986; chapters 8 and 9), that is incorporated herein by reference.

The transmitter further comprises means 44 in which parallel symbols are combined for transmission and which can be implemented for example by means of an adder. The transmitter also comprises means 34 for amplifying and transferring the signal to be transmitted to the frequency used over the radio path.

The transmitter can also be realized in the manner illustrated in FIG. 4b, wherein radio-frequency means 45 a to 45 c are connected in cascade with each means 42 a to 42 c, the signal being transferred to the radio frequency, amplified in the radio-frequency means and supplied from there to an antenna 35.

In the following, the method according to the invention will be described with respect to reception. There are two alternatives for the optimality criterion used in detection: the maximum likelihood (ML) method or the maximum a posteriori (MAP) method, the former being utilized in the present description. Therefore, the log-likelihood function that can be derived from the conditional probability density function of the observed waveform is of the form $\begin{matrix} {{{\left( {B,\alpha} \right)} = {{\frac{2}{N_{0}}{\int{{\Re \left\lbrack {{r(t)}{c^{*}\left( {t,B} \right)}} \right\rbrack}{t}}}} - {\frac{1}{N_{0}}{\int{{{c\left( {t,B} \right)}}^{2}{t}}}}}},} & (2) \end{matrix}$

where ${c\left( {t,B} \right)} = {\sum\limits_{k = 1}^{K}{\sum\limits_{i = {- P}}^{P}{{h_{k}(t)}{w_{k}^{(b_{i})}\left( {t - {iT}_{b} - \tau_{k}} \right)}}}}$

thus denotes the received signal. The derivation of the above formulas in the transmission with a single data rate is described in S. Verdu: Optimum multiuser efficiency (IEEE Trans. Commun., Vol 34, September 1986) that is incorporated herein by reference. Denote from now on ${\alpha_{k,1}(t)} \equiv {\sqrt{\frac{E_{k}}{T_{b}}}{{h_{k,1}(t)}.}}$

The above-described formulas determine the general detection criterion without any assumptions concerning the receiver front-end, typically realized with a number of matched filters. When a despread signal is concerned, the formulas may be treated in the following manner.

It is first assumed without limiting the generality that the channel concerned is a high-capacity channel where information is transmitted utilizing parallel physical channels and where M_(i) traffic channels can be reserved for the use of K_(i) users. This can be interpreted as a system with {tilde over (K)}=ΣK_(i)M_(I) users, where K=ΣK_(i). Assume that the aforementioned {tilde over (K)} information streams are collected in the matrix B_({tilde over (K)}×()2P+1) in such a way that each user with a different data rate adds M_(i) rows to a designated location in the original matrix of the basic data rate by replacing the b_(k) ^((i))s with b_(k) ^((i))s. The log-likelihood function of the despread signal is described with the formula

B _(opt)=arg_(Bε{1−,1})max_({2P+1}×K) _({circumflex over ( )})(B|α,R,τ)

where α=(α_(1,1), . . . , α_(1,L), . . . ,α_(K,L))^(T) denotes the received signal amplitudes of the K users, τ=(τ_(l,1), . . . ,τ_(1,L), . . . , τ_(K,L))^(T) denotes the corresponding delays of the signal components, and R=(R_(−P), . . . , R_(P))ε C^((k×L×N)×(2P+1)) is the matrix of the normalized cross-correlations of the transmitted {tilde over (K)}×(2P+1) symbols, the pth submatrix being R_(p). This corresponds to the effect of cross-correlation observed in the detection of the Pth symbol interval, and it is determined in the formula

R _(P) =[{tilde over (R)} ^((p−N)) , . . . ,{tilde over (R)} ^((p+N))]^(T),

where ${\overset{\sim}{R}}^{(i)} = \begin{bmatrix} R_{1,1}^{(i)} & \ldots & R_{1,\overset{\sim}{K}}^{(i)} \\ \vdots & ⋰ & \vdots \\ R_{\overset{\sim}{K},1}^{(i)} & \ldots & R_{\overset{\sim}{K},\overset{\sim}{K}}^{(i)} \end{bmatrix}$

where the correlation between the lth multipath-propagated signal component of the kth user and the l'th multipath-propagated signal component of the k'th user is obtained from the formula $\left\lbrack {\overset{\sim}{R}}_{k,k^{\prime}}^{(i)} \right\rbrack_{l,l^{\prime}} = {\int_{- \infty}^{\infty}{{c_{k,m}\left( {t - \tau_{k,l}} \right)}{c_{k^{\prime},m^{\prime}}\left( {t - \tau_{k^{\prime},l^{\prime}} + {iT}_{b}} \right)}{{t}.}}}$

It is thus seen that the cross-correlation matrix of the received symbols is a function of the vector τ. The cross-correlation matrix can be estimated from the received signal by estimating the delays τ_(i), the data rates M_(i) and the codes f_(k). Naturally some of these can also be considered known. Taking into account that the system is an asynchronous CDMA system according to formula (1), the log-likelihood function described in formula (2) can now be written as $\begin{matrix} {\left( {{\left. {B{{R,\alpha}}} \right) = {\sum\limits_{i = {- P}}^{P}{\frac{1}{N_{0}}\left( {{2{\Re \left\lbrack {{\hat{\alpha}}^{H}{\hat{B}}^{(i)}z^{(i)}} \right\rbrack}} - {\sum\limits_{i^{\prime} = {- P}}^{P}{\alpha^{T}{\hat{B}}^{(i)}{\hat{R}}^{({i^{\prime} - i})}{\hat{B}}^{({i^{\prime} - i})}\alpha^{*}}}} \right)}}},} \right.} & (3) \end{matrix}$

where ${\hat{B}}^{(i)} = {\begin{bmatrix} {b_{1}^{(i)}I} & \ldots & 0 \\ \vdots & ⋰ & \vdots \\ 0 & \ldots & {b_{\overset{\sim}{K}}^{(i)}I} \end{bmatrix}.}$

The latter sum term in the above formula (3) of the log-likelihood function represents the effect of the neighbouring bits, and in a synchronous system this term is zero. Correspondingly, taking into account that the system comprises several data rates, the above symbol matrix {circumflex over (B)}^((i)) can be written as ${{\hat{B}}^{(i)} = \begin{bmatrix} {b_{1}^{(i)}I} & \ldots & 0 \\ \vdots & ⋰ & \vdots \\ 0 & \ldots & {b_{K}^{(i)}I} \end{bmatrix}},$

where the dimension of the identity matrix related to the kth user is (M_(k)×L)×(M_(k)×L). Therefore, the sufficient characteristic of the received signal required in the detection can be represented by the formula z^((i)) = (z_(1, 1)^((i)), z_(1, 2)^((i)), …  , z_(K, L)^((i)))^(T)

where the vector z_(k,l) ^((i))=(z_(k,l,1) ^((i)), . . . ,z_(k,l,M) _(K) ^((i))). Each term z_(k,l,m) ^((i)) represents a despread signal that is related to the mth information waveform of user k and that has the form z_(k, l, m)^((i)) = ∫_(−∞)^(∞)r(t)c_(k, m)(t − τ_(k, l) − iT_(b))t

where T_(b) denotes the length of the symbol interval.

Assume that BPSK symbols are transmitted, and that the transmitted signal propagates in a fading multipath channel. The multirate detector thus estimates the ith bit of the Kth data stream for example according to the following formula

{circumflex over (b)} _({tilde over (k)}) ^((i))(m+1)=sgn{[{circumflex over (α)}^(H) D _({tilde over (k)}) z ^((i)) −I(i,k,m)]},

where ${I\left( {i,\overset{\sim}{k},m} \right)} = {{\overset{\sim}{\alpha}}^{H}{D_{\overset{\sim}{k}}\left( {\sum\limits_{i^{\prime} = {i - N}}^{i + N}{{\hat{R}}^{({i^{\prime} - i})}I_{\overset{\sim}{k}}^{({i^{\prime} - i})}{{\overset{\sim}{B}}^{({i^{\prime} - i})}(m)}\overset{\sim}{\alpha}}} \right)}}$

represents the interference cancellation term. The matrix operator

D _({tilde over (k)})=diag(d _(1,l) , . . . , d _(1,L) , d _(2,l) , . . . , d _(K,L))

thus picks out the {tilde over (k)}th data stream, i.e. a transmission received by the rake branches receiving the desired signal, and it has the values d_({tilde over (k)},)1= . . . =d_({tilde over (k)},L)=1 on the {tilde over (k)}th submatrix, and 0 elsewhere. The matrix I_(k) comprises the transmission received by the rake branches that are synchronized with the signal of the kth user, and that are thus interference to the desired signal. The matrix I=_({tilde over (k)}) ^((i))=I,∀i≠0, and I_({tilde over (k)}) ⁽⁰⁾=I−D_({tilde over (k)}).{circumflex over (R)} is thus a correlation matrix, and the matrix {tilde over (B)} comprises bit estimates. Usually a multipath-propagated signal is first processed with a rake receiver stage with L diversity arms, and the polarity of the signal is determined, after combining, with a hard limiter. This corresponds to a situation wherein the interference cancellation term is omitted, i.e. I(i,k,m)≡0.

FIG. 5 is a general block diagram illustrating the structure of a receiver according to the invention. The figure is a block diagram of a base station receiver, but the receiver according to the invention can naturally also be realized similarly in a subscriber terminal.

The receiver comprises an antenna 50, and a radio-frequency unit 51 operationally connected thereto, converter means 52 operationally connected in cascade with the radio-frequency parts, means 53 for counting the characteristics required for a decision, the means being operationally connected to the output of the converter means, and channel decoding means 54 operationally connected to the output of the counting means. The receiver also comprises a control unit 55, which controls the operation of the aforementioned components. The receiver naturally also comprises other components, such as filters, but for the sake of clarity they are not described in the above-described example.

A transmission received by the antenna 50 is supplied to the radio-frequency parts 51 wherein the received signal is converted to the desired intermediate frequency. The resultant signal is further supplied to the converter means 52 wherein the signal is converted into a digital form with conventional methods. The digitized transmission is further supplied to the characteristic-counting means 53 wherein the signal is despread, i.e. it is restored to the original frequency band, and demodulation and detection are performed. The operation of the means 53 will be described in greater detail below. The detected signal can be further subjected to channel decoding with known methods in the means 54, and the resultant signal is further supplied to other parts of the receiver.

FIG. 6 is a block diagram illustrating in greater detail the structure of a receiver according to a preferred embodiment of the invention. As described above, the receiver comprises an antenna 50, radio-frequency parts 51 connected thereto, and converter means 52 operationally connected to the output of the radio-frequency parts. Demultiplexing means 60 are operationally connected in the receiver to the output of the converter means, the outputs of the demultiplexing means being supplied to a number of groups 61 a to 61 c of matched filters, each of these groups thus comprising one or several matched filters. The outputs of the matched filters are supplied to interference cancellation means 62 to the output of which a number of signal post-processing means 63 a to 63 c are operationally connected, the number of the latter means being preferably equal to the number of the aforementioned filter groups 61 a to 61 c. Control means 55 control the operation of the described parts of the receiver. The control means 55 are typically realized by means of a processor.

As above, a transmission received by the antenna 50 is supplied to the radio-frequency parts 51 wherein the received signal is converted to the desired intermediate frequency. The resultant signal is further supplied to the converter means 52 wherein the signal is converted into a digital form with conventional means. The digitized transmission is further supplied to the demultiplexing means wherein the received digitized transmission is distributed to the different filter groups 61 a to 61 c. Each group 61 a to 61 c comprises a number of matched filters which can synchronize with the received signal and disassemble a signal component transmitted with the desired spreading code. Each group may comprise a different number of matched filters, and each group may simultaneously have a different number of filters active. The number of entire simultaneously active filter groups thus equals the number {tilde over (K)} of the active users. Each filter group 61 a to 61 c preferably receives a signal transmitted by one user. As described above in connection with the method according to the invention, the signal of one user can be transmitted by utilizing several parallel spreading codes, which may be substantially mutually nonorthogonal or mutually time-orthogonal, depending on the data rate of each user. Different filters of a filter group may thus be synchronized with signals transmitted with different spreading codes, but the signals, however, come from the same user. The control means 55 provide each filter group 61 a to 61 c with data concerning the spreading codes with which the matched filters should synchronize themselves.

The output signals 64 a to 64 c of the matched filter groups 61 a to 61 c comprise the previously described vectors {z_(1,.) ^((i)), . . . ,z_({tilde over (K)},.) ^((i))}, which are thus the despread signals of each user. These signals 64 a to 64 c are supplied further to the interference cancellation means 62 wherein the signal detection is performed by taking into account the correlations between the signals of different users and the signals of the same user transmitted with different codes. The operation of the interference cancellation means 62 will be described in greater detail below. The signal obtained from the interference cancellation means is further supplied to the signal post-processing means 63 a to 63 c which may comprise for example deinterleaving means, channel decoding, multiplexing means, some other receiver stage or means for combining the signal of one user, consisting of several parallel transmissions.

FIG. 7 is a block diagram illustrating a group 61 a of matched filters. The group thus comprises a number of matched filters 80 to 83 which may be realized for example by means of correlators. The implementation of a correlator is described in greater detail in G. Cooper, C. McGillem: Modern Communications And Spread Spectrum (McGraw-Hill, New York 1986, Chapter 12).

FIG. 8 is a block diagram illustrating in greater detail an example of the structure of an interference cancellation block in a receiver according to a preferred embodiment of the invention. The output signals 64 a to 64 c of the matched filter groups, the number of which is {tilde over (K)}, are supplied as input to the interference cancellation unit 70 which may comprise one or several stages 72, 72. The output signal 64 a to 64 c of the filter groups is also supplied as input to a channel estimation block 73 wherein estimates {circumflex over (α)},{circumflex over (τ)},{tilde over ({circumflex over (R)})} are calculated for the signals and channel parameters transmitted at different data rates. Data 75 about the calculated estimates is supplied to the interference cancellation block 70, and when a multiphase interference cancellation algorithm is concerned, the data is supplied to a first interference cancellation block 71 wherein the preliminary estimates {circumflex over (b)}₁, . . . ,{circumflex over (b)}_({tilde over (K)}) 78 a to 78 c are calculated for each user for the received symbols. In case of a multistage interference cancellation algorithm, the calculated preliminary estimates are supplied to a second stage 72 wherein new estimates are calculated for the received signals, the estimates 79 a to 79 c being further supplied to the post-processing unit. The same estimates 76 are also supplied to the channel estimation block 73 wherein better estimates are calculated, on the basis of the more recent estimates, for the channel parameters, which are applied 77 back to the interference cancellation block 72 to be utilized in the detection.

The control means 55 of the receiver naturally receive information 77 concerning the data rate of each connection, and this data can be transmitted between the transmitter and the receiver during the call set-up or it can be detected from the received signal. If the data rate used over the connection changes, information 74 concerning the change must also be forwarded to the channel estimation block 73 wherein the matrix {circumflex over (R)} must be updated.

The type of the interference cancellation algorithm applied in the method and receiver according to the invention is not essential as such. Possible interference cancellation methods are for example decorrelation, Viterbi and multistage interference cancellation methods and other methods known to a person skilled in the art.

Even though the invention is described above with reference to the examples according to the accompanying drawings, it is clear that the invention is not restricted thereto, but it can be modified in many ways within the scope of the inventive idea disclosed in the appended claims. 

What is claimed is:
 1. Data transmission method in a system which utilizes a CDMA method, in which several users communicate simultaneously on the Same frequency band, and in which each user has at least one corresponding broad-band information channel, and in which the information channel capacity of at least one user differs from the capacity of the other users, wherein the parameters of each information channel depend on the desired capacity and transmission quality, and that each information channel is detected by taking into account correlations between different channels corresponding to different users, wherein an effect of correlation arising from different spreading codes of the different channels is removed, and wherein: different users have data symbols of different length; the data symbol lengths of different users are selected in such a way that the symbol lengths used are fractions of the length of a specific given super symbol, the spreading code sequences that modulate the data symbols of the users recur at intervals of the given super symbol, during detection the interference between the users is decreased by taking into account the mutual correlations between the received signals, detection is implemented in such a way that a desired number of signals are received and correlation terms over the super symbol to be detected are calculated, and these correlation terms are utilized in the detection in such a way that the mutual interference between the signals to be transmitted with different data symbol rates is eliminated.
 2. A method according to claim 1, characterized in that the transmission capacity of each information channel can be selected from a group of connection types with different capacities.
 3. A method according to claim 1, characterized in that the information channel is realized by means of a long spreading code.
 4. A method according to claim 1, characterized in that the parameters of the information channel comprise the users's spreading code bit rate, data symbol rate, quality requirement of the signal, and number of spreading codes used per data symbol.
 5. A method according to claim 4, characterized in that at least some of the spreading codes used are substantially mutually nonorthogonal.
 6. A method according to claim 1, characterized in that each user's spreading code bit rate, data symbol rate and number of spreading codes used per data symbol depend on the transmission rate set for the connection.
 7. A method according to claim 1, characterized in that users with a different capacity have a different length of data symbol.
 8. A method according to claim 7, characterized in that the data symbol lengths used in the systems are fractions of the length of the super symbol given.
 9. A method according to claim 8, characterized in that the spreading code sequence used over the connection has the length of the super symbol given.
 10. A method according to claim 9, characterized in that each symbol to be transmitted is multiplied by a spreading code sequence, and some of the sequences are substantially mutually nonorthogonal.
 11. A method according to claim 8, characterized in that the interference cancellation algorithms process the received signal in parts having the length of the super symbol given.
 12. A method according to claim 1, characterized in that spreading codes of different lengths are used over different connections.
 13. A method according to claim 1, characterized in that each information channel is detected by means of a correlation matrix.
 14. A method according to claim 1, further comprising changing the allotted channel in accordance with changes in the data rate.
 15. A transmitter in a system which utilizes the CDMA method and in which several users communicate simultaneously on the same frequency channel, the transmitter comprising means for forming the symbols to be transmitted, wherein the transmitter comprises means regulating the length of the symbols to be transmitted, means for converting a desired number of symbols to be transmitted into a parallel form, means for generating spreading code sequences the number of which equals the number of the symbols to be transmitted in parallel, and means for multiplying each of the symbols to be transmitted by its own sequence, and wherein: different users have data symbols of different length, the data symbol lengths of different users are selected in such a way that the symbol lengths used are fractions of the length of a specific given super symbol, the spreading code sequences that modulate the data symbols of the users recur at intervals of the given super symbol, during detection the interference between the users is decreased by taking into account the mutual correlations between the received signals, detection is implemented in such a way that a desired number of signals are received and correlation terms over the super symbol to be detected are calculated, and these correlation terms are utilized in the detection in such a way that the mutual interference between the signals to be transmitted with different data symbol rates is eliminated.
 16. A transmitter according to claim 15, characterized in that the transmitter comprises means (42 a-42 c) for generating spreading codes some of which are substantially mutually nonorthogonal.
 17. A transmitter according to claim 15, characterized in that the transmitter comprises means (42 a-42 c) for generating spreading code sequences which are formed of successive parts of one long code.
 18. A transmitter according to claim 15, further comprising changing the allotted channel in accordance with changes in the data rate.
 19. A receiver in a system which utilizes a CDMA method, in which several users communicate simultaneously on the same frequency band, and in which each user has its own different spreading code, and in which the information channel capacity of at least one user differs from the capacity of the other users, the receiver comprising converter means for converting a received transmission into a digital form, and a number of means for synchronizing and for calculating a characteristic required for a decision from the transmission of each received user, wherein said number of means each comprise a group of correlators which may be synchronized with waveforms of different types, and that the receiver comprises means for processing said characteristics calculated for the different types of waveforms by eliminating the effect of correlations arising from the different spreading code of each different channel corresponding to each user, and wherein: different users have data symbols of different length, the data symbol lengths of different users are selected in such a way that the symbol lengths used are fractions of the length of a specific given super symbol, the spreading code sequences that modulate the data symbols of the users recur at intervals of the given super symbol, during detection the interference between users is decreased by taking into account the mutual correlations between the received signals, detection is implemented in such a way that a desired number of signals are received and correlation terms over the super symbol to be detected are calculated, and these correlation terms are utilized in the detection in such a way that the mutual interference between the signals to be transmitted with different data symbol rates is eliminated.
 20. A receiver according to claim 19, characterized in that the correlators (80-83) are synchronized and they calculate characteristics for waveforms that differ in length in time, and that the characteristics processed by the means (62) are calculated from waveforms of different lengths.
 21. A receiver according to claim 19, characterized in that the correlators (80-83) are synchronized and they calculate characteristics for waveforms which are parallel, and that the characteristics processed by the means (62) are calculated from parallel waveforms.
 22. A receiver according to claim 21, characterized in that the receiver comprises means (63 a-63 c) for combining the parallel waveforms of each user.
 23. A receiver according to claim 22, characterized in that the receiver comprises control means (55) controlling the operation of the correlators (80-83) and the processing means (62).
 24. A receiver according to claim 19, characterized in that the receiver comprises signal-division means (60) which divide a digitized signal to the different characteristic-calculating means (61 a-61 c) of the receiver.
 25. The receiver of claim 19, further comprising changing the allotted channel in accordance with the changes in the data rate. 